نتایج جستجو برای: finite horizon

تعداد نتایج: 283212  

1997
Jeff S Shamma Dapeng Xiong

We consider the optimization of nonquadratic measures of the transient response. We present a computational implementation of dynamic programming recursions to solve finite-horizon problems. In the limit, the finite-horizon performance converges to the infinite-horizon performance. We provide conditions based on finite-horizon computations which only assure that a receding horizon implementatio...

Journal: :journal of optimization in industrial engineering 2011
seyed mohsen mousavi seyed hamidreza pasandideh

in this article, a finite horizon, multi product and multi period economic order quantity like seasonal items is considered where demand rate is deterministic and known but variable in each period. the order quantities of items come in batch sizes and the end of the period order quantity and, consequently, demand of customers are zero. in addition, storage space is constrained and the problem ...

Journal: :SSRN Electronic Journal 2004

2010
William Branch George W. Evans Bruce McGough

Incorporating adaptive learning into macroeconomics requires assumptions about how agents incorporate their forecasts into their decision-making. We develop a theory of bounded rationality that we call finite-horizon learning. This approach generalizes the two existing benchmarks in the literature: Eulerequation learning, which assumes that consumption decisions are made to satisfy the one-step...

Journal: :Finance and Stochastics 2005

Journal: :SSRN Electronic Journal 2008

ژورنال: کنترل 2020

In this paper, the event-triggered strategy in the case of finite-horizon model predictive control (MPC) is studied and its advantages over the input to state stability (ISS) Lyapunov based triggering rule is discussed. In the MPC triggering rule, all the state trajectories in the receding horizon are considered to obtain the triggering rule. Clearly, the finite horizon MPC is sub-optimal with ...

Journal: :Ergodic Theory and Dynamical Systems 2004

Journal: :Journal of Computer and System Sciences 2022

Fixed-horizon planning considers a weighted graph and asks to construct path that maximizes the sum of weights for given time horizon T. However, in many scenarios, is not fixed, but stopping chosen according some distribution such expected If stopping-time known, then ensure robustness, by an adversary as worst-case scenario. A stationary plan every vertex always chooses same outgoing edge. Fo...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید